packet loss probability meaning in Chinese
分组损失概率
Examples
- The results indicate that the packet loss probability of spc is the limit of spl and spn
结果表明: spc结构的丢包率是spl和spn结构丢包率的极限。 - Theory analyse indicate that the mdf algorithm can get the minimum packet loss probability that is same with faa , and meanwhile it can greatly reduce the number of lrwcs
理论分析表明该算法在达到faa最小丢包率的同时能够更好的节约波长转换器的数目。 - Aimed at the quality of service required by real - time service , an effective bandwidth calculating method for self - similar traffic is presented to provide guaranteed packet loss probability and maximum delay
摘要针对多媒体实时业务需要提供特定服务质量的情况,给出了一种能够同时保证分组丢失概率和最大延时的自相似业务等效带宽计算方法。 - Simulations confirm compared with faa , the mdf can save more lrwcs and fewer packet loss probability , especially in the condition of high load . using mdf algorithm , the number of lrwcs in the condition of high load is more than in the condition of low load when the packet loss rate approaches to a fixed value
通过仿真实验验证了该算法在低、中和高负载情况下,比faa算法更节约波长转换器和更小的丢包率,而且在低负载时mdf算法的优势更加明显。 mdf算法在高负载下,丢包率到达稳定值所需要的lrwcs数目比低负载多。 - In order to solve this problem , a reliable multica st communication model for conference control is designed specially . we firstly study the requirements of multicast - based conference control , then analysis the main factors to the performance of reliable multicast . subsequently we present a new reliable multicast protocol named hsrm ( hierarchical scalable and reliable multicast ) according to the receivers " packet loss probabilities
本文从分布式组播会议控制对网络通信的要求出发,在对影响可靠组播性能的因素进行深入分析基础上,融合现有可靠组播协议的优秀思想,提出了一个新的基于接收方丢失报文概率分组的层次化可扩展可靠组播通信模型hsrm ( hierarchicalscalablereliablemulticast ) 。